// Copyright (C) 2008 Taylor L. Riche <riche@cs.utexas.edu>
//  
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
// 
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
// 
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software 
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//

#include "CommChannel.h"

namespace lagniappe
{

CommChannel::CommChannel()
{
}

CommChannel::~CommChannel()
{
}

unsigned long
CommChannel::incHeap(const RCon * rcon)
{
	if(opCountMap.find(static_cast<Operator *>(rcon->getOp())) == opCountMap.end()) {
		opCountMap[static_cast<Operator *>(rcon->getOp())] = 0;
	}
	else {
		opCountMap[static_cast<Operator *>(rcon->getOp())] += 1;
	}
	return opCountMap[static_cast<Operator *>(rcon->getOp())];
}

unsigned long
CommChannel::decHeap(const RCon * rcon)
{
	assert(opCountMap.find(static_cast<Operator *>(rcon->getOp())) != opCountMap.end());
	opCountMap[static_cast<Operator *>(rcon->getOp())] -= 1;
	return opCountMap[static_cast<Operator *>(rcon->getOp())];
}

Operator *
CommChannel::getLoadedOperator()
{
	Operator * bigOp = NULL;
	unsigned long bigInt = 0;
	for(std::map<Operator *, unsigned long>::iterator iter = opCountMap.begin(); 
		iter != opCountMap.end(); iter++) {
		
		if (iter->second > bigInt) {
			bigInt = iter->second;
			bigOp = iter->first;
		}
	}
	return bigOp;
}

}
